Formally Verified Approximations of Definite Integrals
نویسندگان
چکیده
منابع مشابه
Formally Verified Modular Semantics
This chapter presents the results of the validation and verification of a crucial component of BOS, a large safety-critical system that decides when to close and open the Maeslantkering, a storm surge barrier near the city of Rotterdam in the Netherlands. BOS was specified in the formal language Z and model checking has been applied to some of its subsystems during its development. A lightweigh...
متن کاملFormally Verified System Initialisation
The safety and security of software systems depends on how they are initially configured. Manually writing program code that establishes such an initial configuration is a tedious and error-prone engineering process. In this paper we present an automatic and formally verified initialiser for component-based systems built on the general-purpose microkernel seL4. The construction principles of th...
متن کاملFormally Verified On-Line Diagnosis
A recon gurable fault tolerant system achieves the attributes of dependability of operations through fault detection fault isolation and recon guration typically referred to as the FDIR paradigm Fault diagnosis is a key component of this approach requiring an accurate deter mination of the health and state of the system An imprecise state assessment can lead to catastrophic failure due to an op...
متن کاملA Formally-Verified Alias Analysis
This paper reports on the formalization and proof of soundness, using the Coq proof assistant, of an alias analysis: a static analysis that approximates the flow of pointer values. The alias analysis considered is of the points-to kind and is intraprocedural, flow-sensitive, field-sensitive, and untyped. Its soundness proof follows the general style of abstract interpretation. The analysis is d...
متن کاملTwo adaptive Gauss-Legendre type algorithms for the verified computation of definite integrals
We propose a two algorithms for computation of (sharp) enclosures of definite interevals: a lor.rd adaptive dgorid~a (LAA) and a g/oba/ a&,pth~ cdgor92~n (GAA). Both algorithms are based (m Gauss-Legendre ~ladrature. Error terms are bounded using automatic differentiation in combination with interval evah:adons. Several nmnerical examples are presented; these examples include comparis~m with an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Automated Reasoning
سال: 2018
ISSN: 0168-7433,1573-0670
DOI: 10.1007/s10817-018-9463-7